Binary Random Sequences Obtained From Decimal Sequences

D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autocorrelation properties of the d sequence based recursive random number generator were studied in [10] where an approach for multi-recursive random number generator was also proposed. These methods were all based on a direct binary representation of appropriately chosen numbers.